Embeddings into the Pancake Interconnection Network
نویسنده
چکیده
Owing to its nice properties, the pancake is one of the Cayley graphs that were proposed as alternatives to the hypercube for interconnecting processors in parallel computers. In this paper, we present embeddings of rings, grids and hypercubes into the pancake with constant dilation and congestion. We also extend the results to similar efficient embeddings into the star graph.
منابع مشابه
[hal-00465652, v1] Embeddings into the Pancake Interconnection Network
Owing to its nice properties, the pancake is one of the Cayley graphs that were proposed as alternatives to the hypercube for interconnecting processors in parallel computers. In this paper, we present embeddings of rings, grids and hypercubes into the pancake with constant dilation and congestion. We also extend the results to similar efficient embeddings into the star graph.
متن کاملEmbedding hypercubes into pancake, cycle prefix and substring reversal networks
Among Cayley graphs on the symmetric group, some that have noticeably low diameter relative to the number of generators involved are the pancake network, burnt pancake network, and cycle prefix network [1,6,7,8]. Another such Cayley graph is the star network, and constructions have been given for one-to-one and one-tomany low dilation embeddings of hypercubes into star networks [11,12,15]. For ...
متن کاملEmbedding Complete Binary Trees into Star Networks
Abs t rac t . Star networks have been proposed as a possible interconnection network for massively parallel computers. In this paper we investigate embeddings of complete binary trees into star networks. Let G and H be two networks represented by simple undirected graphs. An embedding of G into H is an injective mapping f from the vertices of G into the vertices of H. The dilation of the embedd...
متن کاملComparing Star and Pancake Networks
Low dilation embeddings are used to compare similarities between star and pancake networks. The pancake network of dimension n, Pn, has n! nodes, one for each permutation, and an undirected edge between permutations (nodes) when some prefix reversal transforms one permutation into the other. The star network of dimension n, Sn, has n! nodes, one for each permutation, and an undirected edge betw...
متن کاملA Parallel Algorithm for Interpolation in Pancake Graph
In this paper a parallel algorithm for Lagrange interpolation is applied on a n-pancake graph. The npancake graph is a Cayley graph with N=n! vertices and with attractive properties regarding degree, diameter, symmetry, embeddings and self similarity. Using these properties the algorithm carries the calculation in O(N) steps of communication and arithmetic operations instead of O(N) steps for a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Parallel Processing Letters
دوره 12 شماره
صفحات -
تاریخ انتشار 2002